Skip to main content

Systems of Linear Equations

Basically simultaneous equations. Can be written as Ax=bAx=b

The coefficient matrix AA is said incomplete matrix. The matrix AcRm,n+1A^c\in \R_{m,n+1} whose first nn columns are those of the matrix AA and the (n+1th)(n+1^{th}) column is the vector bb is said complete matrix

Ac=(Ab)=A^c=(A|b)=

Cramer's Theorem

If AA is non-singular , the is only one solution simultaneously satisfying all the equations: if detA0detA\ne 0 then !x\exist!x such that Ax=bAx=b

Hybrid Matrix

Hybrid matrix with respect to the ithi^{th} column is the matrix AiA_i obtained from AA by substituting the ithi^{th} column with bb (Switch aia^i with bb)

Cramer's Method

For a given system of linear equations Ax=bAx=b with AA non-singular, a generic solution xix_i element of xx can be computed as xi=detAidetAx_i=\frac{detA_i}{detA}

For a square matrices would repeat 3 times, change column 3 times with bb